地基承载力的数值分析方法

介绍了边坡稳定的塑性力学上限解在计算地基承载力方面的推广。简要回顾了由Ｄｏｎａｌｄ和Ｃｈｅｎ提出的能量法的基本原理，说明该法可以得出与闭合解一样精确的解答，使用此数值方法来复核地基容重不为零时承载力计算的各种经验方法，发现这些经验方法在大多数情况下均低估了地基的承载力。计算基础有埋深和荷载偏心的经验公式也低估了地基承载力约５％～１０％。     

基于光场相机的深度面光场计算重构

光场相机与传统相机不同,通过在主镜组和传感器间特定位置设置微透镜阵列,实现在采集物方光强的同时记录光线方向。为了重构物方光场,研究了基于光场相机的深度面计算重构算法,对该算法所采用的焦点堆栈、投影切片定理进行研究。首先,对四维光场定义及光场相机工作原理进行分析;建立了相机内部深度面重构模型,分析了投影切片定理在深度面获取的应用,并推导出不同深度面图像表达式;根据得到不同深度位置图像,研究了计算重构算法,搭建了含有微透镜阵列的微型单相机光场采集系统,采集原始光场,利用本文方法实现了物方光场的逆向重构。实验结果表明:利用本文重构算法,光场相机采集的物方光场可通过滤波计算方法逆向重构,通过重构光场数据可获得物方场景深度信息。本文深度面获取算法较其他算法节省30%以上的时间,各深度面图像峰值信噪比在25~30dB之间,实现了高精度、稳定可靠的计算光场重构。     

修正三角模糊事故树算法在化工生产事故预测中的应用

基于传统三角模糊事故树预测模型存在因线性近似导致误差较大的不足,通过截集定理分析了误差的来源,根据表现定理给出了事故树顶上事件三角模糊数隶属度曲线绘制的改进算法。使用MATLAB软件编制程序,分别采用修正的和传统的三角模糊事故预测算法,针对油库静电积累事故进行预测,计算8个原因事件的模糊重要度。计算结果显示,与传统算法相比,修正算法8个基本事件的模糊重要度计算误差平均降低11.91%,表明修正算法极大地优化了传统算法的不足。     

Probabilistic stability of uncertain composite plates and stochastic irregularity in their buckling mode shapes: A semi-analytical non-intrusive approach

In this study, the mechanical properties of the composite plate were considered Gaussian random fields and their effects on the buckling load and corresponding mode shapes were studied by developing a semi-analytical non-intrusive approach. The random fields were decomposed by the Karhunen−Loève method. The strains were defined based on the assumptions of the first-order and higher-order shear-deformation theories. Stochastic equations of motion were extracted using Euler–Lagrange equations. The probabilistic response space was obtained by employing the non-intrusive polynomial chaos method. Finally, the effect of spatially varying stochastic properties on the critical load of the plate and the irregularity of buckling mode shapes and their sequences were studied for the first time. Our findings showed that different shear deformation plate theories could significantly influence the reliability of thicker plates under compressive loading. It is suggested that a linear relationship exists between the mechanical properties’ variation coefficient and critical loads’ variation coefficient. Also, in modeling the plate properties as random fields, a significant stochastic irregularity is obtained in buckling mode shapes, which is crucial in practical applications.     

How heterogeneous community engage newcomers? The effect of community diversity on newcomers’ perception of inclusion: An empirical study in social media service

Online communities that provide social media services need to engage newcomers so as to not lose them to competitors. This study examines the role of community diversity (in terms of perceived visible dissimilarity, perceived informational dissimilarity and perceived value dissimilarity) in influencing perceived inclusion of newcomers in the online community and the influence of such perception on newcomers’ engagement intention. The theoretical background on perceived inclusion is obtained from the optimal distinctiveness theory, which comprises of two dimensions, namely, social identification and perceived uniqueness. The results support the multiple roles of community diversity on a newcomer’s perceived inclusion. The findings of this study contribute to a better understanding of the effect of community diversity on newcomers’ engagement behavior, and provide recommendations on designing a personalized community diversity environment.     

Study of planar structure applying reciprocity technique combined with MGEC and analysis of discontinuity

The 3D structure electromagnetic computation presents several difficulties related to the volume mesh. In fact, the entire volume space must be taken into account even the smallest details. In this article, we propose a formulation based on the reciprocity theorem combined with the generalized equivalent circuit method to model a planar 3D structure with both coaxial and planar excitation. The major advantage of this formulation is the fact to reduce the computational volume into 2D ones in the discontinuity plane. In addition, we focused on the calculation of the discontinuity between the excitation source and the planar structure to determine the exact behavior of the electric coaxial excitation model. The obtained current density, electric field distributions, and the input impedance are presented and discussed in the following sections. An approximately good agreement of input impedance with those obtained by the simulator and measurement is shown.     

Two-stage iterations based on composite splittings for rectangular linear systems

In this paper, we introduce a two-stage method to solve rectangular linear systems that exhibits faster convergence than typical stationary iterative methods. Under suitable conditions, we prove convergence of the new method. The number of outer iterations can be reduced by using a few significant number of inner iterations for efficient computations. Further, we perform a comparison analysis, and establish that a higher number of inner iterations ensures a smaller spectral radius of the global iteration matrix. We also discuss the uniqueness of a proper splitting, and illustrate different comparison theorems for different subclasses of proper splittings.     

Almost sure exponential convergence to consensus of random gossip algorithms

In this paper, we provide a proof of almost sure exponential convergence to consensus for a general class of ergodic edge selection processes. The proof is based on the multiplicative ergodic theorem of Oseledec and also applies to continuous time gossip algorithms. An example of exponential convergence in a non ergodic case is also discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

Simplicity in Eulerian circuits: Uniqueness and safety

An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if a graph G has a unique Eulerian circuit can be done in polynomial time via the BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte (1941–1951) [15], [16] (involving counting arborescences), or via a tailored characterization by Pevzner, 1989 (involving computing the intersection graph of simple cycles of G), both of which thus rely on overly complex notions for the simpler uniqueness problem.In this paper we give a new linear-time checkable characterization of directed graphs with a unique Eulerian circuit. This is based on a simple condition of when two edges must appear consecutively in all Eulerian circuits, in terms of cut nodes of the underlying undirected graph of G. As a by-product, we can also compute in linear-time all maximal safe walks appearing in all Eulerian circuits, for which Nagarajan and Pop proposed in 2009 [12] a polynomial-time algorithm based on Pevzner characterization.